A Cumulative Monadic Metalanguage
نویسنده
چکیده
We introduce a monadic metalanguage which combines two previously proposed monadic metalanguages: one for staging and the other for value recursion. The metalanguage includes also extensible records as a basic name management facility.
منابع مشابه
A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types
This paper presents a typed higher-order concurrent functional programming language, based on Moggi’s monadic metalanguage and Reppy’s Concurrent ML. We present an operational semantics for the language, and show that a higherorder variant of the traces model is fully abstract for maytesting. This proof uses a program logic based on Hennessy– Milner logic and Abramsky’s domain theory in logical...
متن کاملCoherence of subsumption for monadic types
One approach to give semantics to languages with subtypes is by translation to target languages without subtyping: subtypings A B are interpreted via conversion functions A→B. This paper shows how to extend the method to languages with computational effects, using Moggi’s computational metalanguage.
متن کاملMonads and Adjunctions for Global Exceptions
In this paper, we look at two categorical accounts of computational effects (strong monad as a model of the monadic metalanguage, adjunction as a model of call-bypush-value with stacks), and we adapt them to incorporate global exceptions. In each case, we extend the calculus with a construct, due to Benton and Kennedy, that fuses exception handling with sequencing. This immediately gives us an ...
متن کاملA Monadic Multi-stage Metalanguage
We describe a metalanguage MMML, which makes explicit the order of evaluation (in the spirit of monadic metalanguages) and the staging of computations (as in languages for multi-level binding-time analysis). The operational semantics of MMML is very intuitive and consists of two parts: local (semantic preserving) simplification rules, and steps of computation executed in a deterministic order (...
متن کاملStrong Normalization of Moggis's Computational Metalanguage
Handling variable binding is one of the main difficulties in formal proofs. In this context, Moggi’s computational metalanguage serves as an interesting case study. It features monadic types and a commuting conversion rule that rearranges the binding structure. Lindley and Stark have given an elegant proof of strong normalization for this calculus. The key construction in their proof is a notio...
متن کامل